Gilbert-Varshamov type bounds for linear codes over finite chain rings
نویسندگان
چکیده
We obtain finite and asymptotic Gilbert-Varshamov type bounds for linear codes over finite chain rings with various weights.
منابع مشابه
On Gilbert-Varshamov type bounds for Z2k linear codes
In this paper we derive a Gilbert-Varshamov type bound for linear codes over Galois rings GR(pl; j): However, this bound does not guarantee existence of better linear codes over GR(pl; j) than the usual Gilbert-Varshamov bound for linear codes over the residue class field GR(pj): Next we derive a Gilbert-Varshamov type bound for Z4 linear codes which guarantees the existence of Z4 linear codes ...
متن کاملA Gilbert-Varshamov type bound for linear codes over Galois rings
In this paper we derive a Gilbert-Varshamov type bound for linear codes over Galois rings. For linear codes over the Galois ring GR(pl; j) the result can be stated as follows. Given r; such that 0 < r < 1 and 0 < H 1 pj (1 r): Then for all n N; where N is a sufficiently large integer, there exist [n; k] GR linear codes over GR(pl; j) such that k=n r and d=n : Consequently, this bound does not g...
متن کاملConstructions and bounds on linear error-block codes
We obtain new bounds on the parameters and we give new constructions of linear error-block codes. We obtain a Gilbert–Varshamov type construction. Using our bounds and constructions we obtain some infinite families of optimal linear error-block codes over F2. We also study the asymptotic of linear error-block codes. We define the real valued function αq,m,a(δ), which is an analog of the importa...
متن کاملStrengthening the Gilbert–Varshamov bound
The paper discusses some ways to strengthen (nonasymptotically) the Gilbert–Varshamov bound for linear codes. The unifying idea is to study a certain graph constructed on vectors of low weight in the cosets of the code, which we call the Varshamov graph. Various simple estimates of the number of its connected components account for better lower bounds on the minimum distance of codes, some of t...
متن کاملAlgebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (GV for short) bound. Until now, the GV bound still remains to be the best asymptotical lower bound for LCD codes. In this paper, we show that an algebraic geometry code over a finite field of even characteristic is eq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. in Math. of Comm.
دوره 1 شماره
صفحات -
تاریخ انتشار 2007